#include<cstdio>//BAONI
#include<algorithm>

template<class T>void read(T &x)
{
	x=0;int f=0;char ch=getchar();
	while(ch<'0'||ch>'9') { f|=(ch=='-'); ch=getchar(); }
	while(ch<='9'&&ch>='0') { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); }
	x = f ? -x : x;
	return ;
}

int n,k;
long long int sum;
long long int f1b,f2b;

int solution()
{
	for(int i=1;i<=n;++i)
	{
		read(k);
		sum+=k;
	}
	for(int i=1;i<=n;++i)
	{
		read(k);
		if(k>=f1b)
		{
			f2b=f1b;
			f1b=k;
		}
		else 
		{
			if(k>=f2b)
			{
				f2b=k;
			}
		}
	}
	if(f1b+f2b>=sum)printf("YES");
	else printf("NO");
	return 0;
}

int main()
{
	read(n);
	solution();
	return 0;
}
